Automating Partial Period Bond Valuation With Excels Day Counting Functions
نویسندگان
چکیده
منابع مشابه
Convertible bond valuation: 20 out of 30 day soft-call
Soft-call” in convertible bonds (CBs) usually means that the bond can be recalled by the issuer only if the stock price has previously closed above a specified trigger price for any 20 out of any 30 consecutive trading days. It is not an easy optionality to value and to my knowledge no method has been implemented besides Monte Carlo. The problem is not very well suited to Monte Carlo due to a l...
متن کاملFuzzy type theory with partial functions
This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...
متن کاملSoftware with Partial Functions: Automating Correctness Proofs via Nonstrict Explicit Domains∗
As our society becomes technologically more complex, computers are being used in greater and greater numbers of high consequence systems. Giving a machine control over the lives of humans can be disturbing, especially if the software that is run on such a machine has bugs. Formal reasoning is one of the most powerful techniques available to demonstrate the correctness of a piece of software. Wh...
متن کاملAutomating Surfaces’ Form Correction with Autocorrelation Functions
Dealing with a surface’s form is an essential part of any topographical study of the said surface’s roughness. We present here a method for automatic correction of the form, using very simple concepts to solve a problem where top notch technologies were not enough mature to tackle. After explaining how well known mathematical tools such as the correlation function relate to this problem, we wil...
متن کاملCounting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of College Teaching & Learning (TLC)
سال: 2009
ISSN: 2157-894X,1544-0389
DOI: 10.19030/tlc.v6i4.1149